On 0L-Languages

On 0L-Languages

A Note on Slender 0l Languages

We give a complete proof of Theorem 3.1 in [2]. A pathological exception of Theorem 4.3 in [2] is exhibited and a condition to remove it is mentioned. TUCS Research Group Mathematical Structures of Computer Science

Infiniteness and Boundedness in 0L, DT0L, and T0L Systems

We investigate the boundary between finiteness and infiniteness in three types of L systems: 0L, DT0L, and T0L. We establish necessary and sufficient conditions for 0L, DT0L, and T0L systems to be infinite, and characterize the boundedness of finite classes of such systems. First, we give a pumping lemma for these systems, proving that the language of a system is infinite iff the system is pump...

A Mathematical Investigation of Propagating Graph 0L Systems

Parallel and propagating graph 0I, systems are investigated mathematically. It is shown that bounded degreeness is decidable for a "doubly iqteractionless" subclass of these systems. Various subgraph occurrence problems are shown to be decidable as well as various notions of growth or size equivalence.

Infinite Arrays and Controlled Deterministic Table 0L Array Systems

Deterministic talble OL array systems with control are considered for the generation of infinite arrays. Rewriting of a rectangular array is done in parallel by a table of rules, the rightmost edge horizontally or the lowermost edge vertically downwards. The application of the tables IS controlled by a control set. Cube-free and square-free infinite arrays are obtained as an application of this...